Using State-Based Planning Heuristics for Partial-Order Causal-Link Planning

نویسندگان

  • Pascal Bercher
  • Thomas Geier
  • Susanne Biundo-Stephan
چکیده

We present a technique which allows partial-order causallink (POCL) planning systems to use heuristics known from state-based planning to guide their search. The technique encodes a given partially ordered partial plan as a new classical planning problem that yields the same set of solutions reachable from the given partial plan. As heuristic estimate of the given partial plan a state-based heuristic can be used estimating the goal distance of the initial state in the encoded problem. This technique also provides the first admissible heuristics for POCL planning, simply by using admissible heuristics from state-based planning. To show the potential of our technique, we conducted experiments where we compared two of the currently strongest heuristics from state-based planning with two of the currently best-informed heuristics from POCL planning.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Hybrid Planning Heuristics Based on Task Decomposition Graphs

Hybrid Planning combines Hierarchical Task Network (HTN) planning with concepts known from Partial-Order Causal-Link (POCL) planning. We introduce novel heuristics for Hybrid Planning that estimate the number of necessary modifications to turn a partial plan into a solution. These estimates are based on the task decomposition graph that contains all decompositions of the abstract tasks in the p...

متن کامل

Hybrid Planning - Theoretical Foundations and Practical Applications

The thesis presents a novel set-theoretic formalization of (propositional) hybrid planning – a planning framework that fuses Hierarchical Task Network (HTN) planning with Partial-Order Causal-Link (POCL) planning. Several sub classes thereof are identified that capture well-known problems such as HTN planning and POCL planning. For these problem classes, the complexity of the plan-existence pro...

متن کامل

VHPOP: Versatile Heuristic Partial Order Planner

VHPOP is a partial order causal link (POCL) planner loosely based on UCPOP. It draws from the experience gained in the early to mid 1990’s on flaw selection strategies for POCL planning, and combines this with more recent developments in the field of domain independent planning such as distance based heuristics and reachability analysis. We present an adaptation of the additive heuristic for pl...

متن کامل

Planning Via Petri Net Unfolding: Generalisation and Improvements

Recent research has connected automated planning and techniques for analysing reachability in Petri nets. One outcome is a new forward search approach to partial-order planning, based on translating planning problems into Petri nets and guiding a Petri net reachability technique called unfolding with planning heuristics. Unfolding is an attractive method for planning as it naturally enables the...

متن کامل

Learning rewrite rules to improve plan quality

Considerable planning and learning research has been devoted to the problem of learning domain specific search control rules to improve planning efficiency. There have also been a few attempts to learn search control rules that improve plan quality but such efforts have been limited to state-space planners. The reason being that most of the newer planning approaches are based on plan refinement...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2013